Trahtenbrot-Zykov problem and NP-completeness
نویسندگان
چکیده
منابع مشابه
NP-completeness Proof: RBCDN Reduction Problem
Suppose {R1, . . . , Rk} is the set of all possible regions [?] of graph G. Consider a k-dimensional vector C whose i-th entry, C[i], indicates the number of connected components in which G decomposes when all nodes in Ri fails. Then, region-based component decomposition number (RBCDN) of graphG with region R is defined as αR(G) = max1≤i≤k C[i]. Suppose the RBCDN of G with region R is αR(G). If...
متن کاملContractibility and NP-completeness
For a fixed graph H, let H-CON denote the problem of determining whether a given graph is contractible to H. The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4. In particular, H-CON is NP-complete if H is a connected triangle-free graph other than a star. For each connected graph H of order a t most 4 other ...
متن کاملDNA Computing and Its Application on NP- Completeness Problem
DNA computing is emerging research area that attracts many researchers in multidiscipline area range from biology, physics, mathematics, and computer science. Nowadays, many researchers already solved problem using this technique, mostly classified as NP (Nondeterministic Polynomial) problem since the inheritance of DNA computing in processing simultaneously and it huge memory capacity. Despite...
متن کاملBroadcasting and NP - completeness
In this note, we answer two questions arising in broadcasting problems in networks. We rst describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness of nding disjoint spanning trees of minimum depth, rooted at a given vertex.
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90679-a